A Class of Rectangular Hybrid Systems with Computable Reach Set
نویسندگان
چکیده
A class of rectangular hybrid systems is presented whose reach set is computable. The class is speciied in terms of a controllability condition. That condition can be veriied.
منابع مشابه
SPeeDI - A Verification Tool for Polygonal Hybrid Systems
Hybrid systems combining discrete and continuous dynamics arise as mathematical models of various artificial and natural systems, and as an approximation to complex continuous systems. A very important problem in the analysis of the behavior of hybrid systems is reachability. It is well-known that for most non-trivial subclasses of hybrid systems this and all interesting verification problems a...
متن کاملGenerating Box Invariants
Box invariant sets are box-shaped positively invariant sets. We show that box invariants are computable for a large class of nonlinear and hybrid systems. The technique for computing these invariants is based on nonlinear constraint solving. This paper also shows that the class of multiaffine systems, which has been used successfully for modeling and analyzing regulatory and biochemical reactio...
متن کاملGenerating Polynomial Invariants for Hybrid Systems
We present a powerful computational method for automatically generating polynomial invariants of hybrid systems with linear continuous dynamics. When restricted to linear continuous dynamical systems, our method generates a set of polynomial equations (algebraic set) that is the best such over-approximation of the reach set. This shows that the set of algebraic invariants of a linear system is ...
متن کاملOn Reachability for Hybrid Automata over Bounded Time
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational value. We show that, in contrast to the classical (unbounded) reachability problem, the timed-bounded version is decidable for rectangular hybrid automata provide...
متن کاملLimited-Time Lookahead Diagnosability of Rectangular Hybrid Automata
This paper investigates the diagnosability of Rectangular Hybrid Automata used for modeling a class of hybrid systems. First, a generalized definition of Limited-Time Lookahead diagnosability of timed languages, for multiple failure modes, is proposed. Then, we provide a systematic approach, for checking the LTLa diagnosability of systems modeled with Rectangular Hybrid Automata, and verifying ...
متن کامل